Efficient Implementation of a High Assurance Vote Encryption Verification Technique
ثبت نشده
چکیده
This paper presents MarkPledge3 (MP3), the most efficient implementation of the MarkPledge (MP) technique. The MP technique allows the voter to verify that her vote is correctly encrypted with a soundness of 1−2−α, with 20 ≤ α ≤ 30, just by performing a match of a small string (4-5 characters). MP3 presents significant improvements over the previous MP specifications MP1 and MP2, namely approximately an α factor improvement over MP1 and a minimum improvement of 20% over MP2.
منابع مشابه
An Efficient and Highly Sound Voter Verification Technique and Its Implementation
This paper presents MarkPledge3 (MP3), the most efficient specification of the MarkPledge (MP) technique. The MP technique allows the voter to verify that her vote is correctly encrypted with a soundness of 1−2−α, with 20 ≤ α ≤ 30, just by performing a match of a small string (4-5 characters). Due to its simplicity, verifying the election public data (vote encryptions and tally) in MP3 is 2.6 t...
متن کاملAn Efficient and Highly Sound Voter Verification Technique and its Implementation - Extended Version
This paper presents MarkPledge3 (MP3), the most efficient specification of the MarkPledge (MP) technique. The MP technique allows the voter to verify that her vote is correctly encrypted with a soundness of 1−2−α, with 20 ≤ α ≤ 30, just by performing a match of a small string (4-5 characters). Due to its simplicity, verifying the election public data (vote encryptions and tally) in MP3 is 2.6 t...
متن کاملVoter Verifiability in Homomorphic Election Schemes
Voters are now demanding the ability to verify that their votes are cast and counted as intended. Most existing cryptographic election protocols do not treat the voter as a computationally-limited entity separate from the voting booth, and therefore do not ensure that the voting booth records the correct vote. David Chaum and Andrew Neff have proposed mixnet schemes that do provide this assuran...
متن کاملEncrypted Receipts for Voter-verified Elections Using Homomorphic Encryption
Voters are now demanding the ability to verify that their votes are cast and counted as intended. Most existing cryptographic election protocols do not treat the voter as a computationally-limited entity separate from the voting booth, and therefore do not ensure that the voting booth records the correct vote. David Chaum and Andrew Neff have proposed mixnet schemes that do provide this assuran...
متن کاملHow to prove the validity of a complex ballot encryption to the voter and the public
One crucial aspect of any verifiable electronic voting system that uses encryption is the proof that the vote encryption is well-formed, i.e. the proof that the vote encryption encrypts a valid vote accordingly to the race specification. It makes no sense accepting an encrypted vote if, at the end of the election, the vote cannot be included in the tally because it is badly formed. Proving the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010